Percolation, renormalization, and quantum computing with non-deterministic gates

We apply a notion of static renormalization to the preparation of entangled states for quantum computing, exploiting ideas from percolation theory. Such a strategy yields a novel way to cope with the randomness of non-deterministic quantum gates. This is most relevant in the context of optical architectures, where probabilistic gates are common, and cold atoms in optical lattices, where hole defects occur. We demonstrate how to efficiently construct cluster states without the need for rerouting, thereby avoiding a massive amount of conditional dynamics; we furthermore show that except for a single layer of gates during the preparation, all subsequent operations can be shifted to the final adapted single qubit measurements. Remarkably, cluster state preparation is achieved using essentially the same scaling in resources as if deterministic gates were available.Comment: 5 pages, 4 figures, discussion of strategies to deal with further imperfections extended, references update

Cluster state preparation using gates operating at arbitrary success probabilities

Several physical architectures allow for measurement-based quantum computing using sequential preparation of cluster states by means of probabilistic quantum gates. In such an approach, the order in which partial resources are combined to form the final cluster state turns out to be crucially important. We determine the influence of this classical decision process on the expected size of the final cluster. Extending earlier work, we consider different quantum gates operating at various probabilites of success. For finite resources, we employ a computer algebra system to obtain the provably optimal classical control strategy and derive symbolic results for the expected final size of the cluster. We identify two regimes: When the success probability of the elementary gates is high, the influence of the classical control strategy is found to be negligible. In that case, other figures of merit become more relevant. In contrast, for small probabilities of success, the choice of an appropriate strategy is crucial.Comment: 7 pages, 9 figures, contribution to special issue of New J. Phys. on "Measurement-Based Quantum Information Processing". Replaced with published versio

The efficiencies of generating cluster states with weak non-linearities

We propose a scalable approach to building cluster states of matter qubits using coherent states of light. Recent work on the subject relies on the use of single photonic qubits in the measurement process. These schemes can be made robust to detector loss, spontaneous emission and cavity mismatching but as a consequence the overhead costs grow rapidly, in particular when considering single photon loss. In contrast, our approach uses continuous variables and highly efficient homodyne measurements. We present a two-qubit scheme, with a simple bucket measurement system yielding an entangling operation with success probability 1/2. Then we extend this to a three-qubit interaction, increasing this probability to 3/4. We discuss the important issues of the overhead cost and the time scaling. This leads to a "no-measurement" approach to building cluster states, making use of geometric phases in phase space.Comment: 21 pages, to appear in special issue of New J. Phys. on "Measurement-Based Quantum Information Processing

Brokered Graph State Quantum Computing

We describe a procedure for graph state quantum computing that is tailored to fully exploit the physics of optically active multi-level systems. Leveraging ideas from the literature on distributed computation together with the recent work on probabilistic cluster state synthesis, our model assigns to each physical system two logical qubits: the broker and the client. Groups of brokers negotiate new graph state fragments via a probabilistic optical protocol. Completed fragments are mapped from broker to clients via a simple state transition and measurement. The clients, whose role is to store the nascent graph state long term, remain entirely insulated from failures during the brokerage. We describe an implementation in terms of NV-centres in diamond, where brokers and clients are very naturally embodied as electron and nuclear spins.Comment: 5 pages, 3 figure

Quasi-probability representations of quantum theory with applications to quantum information science

This article comprises a review of both the quasi-probability representations of infinite-dimensional quantum theory (including the Wigner function) and the more recently defined quasi-probability representations of finite-dimensional quantum theory. We focus on both the characteristics and applications of these representations with an emphasis toward quantum information theory. We discuss the recently proposed unification of the set of possible quasi-probability representations via frame theory and then discuss the practical relevance of negativity in such representations as a criteria for quantumness.Comment: v3: typos fixed, references adde

Strategies for the preparation of large cluster states using non-deterministic gates

The cluster state model for quantum computation has paved the way for schemes that allow scalable quantum computing, even when using non-deterministic quantum gates. Here the initial step is to prepare a large entangled state using non-deterministic gates. A key question in this context is the relative efficiencies of different 'strategies', i.e. in what order should the non-deterministic gates be applied, in order to maximize the size of the resulting cluster states? In this paper we consider this issue in the context of 'large' cluster states. Specifically, we assume an unlimited resource of qubits and ask what the steady state rate at which 'large' clusters are prepared from this resource is, given an entangling gate with particular characteristics. We measure this rate in terms of the number of entangling gate operations that are applied. Our approach works for a variety of different entangling gate types, with arbitrary failure probability. Our results indicate that strategies whereby one preferentially bonds together clusters of identical length are considerably more efficient than those in which one does not. Additionally, compared to earlier analytic results, our numerical study offers substantially improved resource scaling